Localized K-Flats
نویسندگان
چکیده
K-flats is a model-based linear manifold clustering algorithm which has been successfully applied in many real-world scenarios. Though some previous works have shown that K-flats doesn’t always provide good performance, little effort has been devoted to analyze its inherent deficiency. In this paper, we address this challenge by showing that the deteriorative performance of K-flats can be attributed to the usual reconstruction error measure and the infinitely extending representations of linear models. Then we propose Localized K-flats algorithm (LKF), which introduces localized representations of linear models and a new distortion measure, to remove confusion among different clusters. Experiments on both synthetic and real-world data sets demonstrate the efficiency of the proposed algorithm. Moreover, preliminary experiments show that LKF has the potential to group manifolds with nonlinear structure.
منابع مشابه
Learning Manifolds with K-Means and K-Flats
We study the problem of estimating a manifold from random samples. In particular, we consider piecewise constant and piecewise linear estimators induced by k-means and k-flats, and analyze their performance. We extend previous results for k-means in two separate directions. First, we provide new results for k-means reconstruction on manifolds and, secondly, we prove reconstruction bounds for hi...
متن کاملThe number of rank-k flats in a matroid with no U2, n-minor
We show that, if k and ` are positive integers and r is sufficiently large, then the number of rank-k flats in a rank-r matroid M with no U2,`+2-minor is less than or equal to number of rank-k flats in a rank-r projective geometry over GF(q), where q is the largest prime power not exceeding `.
متن کاملSapiro IMA Preprint Series # 2247 ( April 2009 ) INSTITUTE FOR MATHEMATICS AND ITS APPLICATIONS
The k q-flats algorithm is a generalization of the popular k-means algorithm where q dimensional best fit affine sets replace centroids as the cluster prototypes. In this work, a modification of the k q-flats framework for pattern classification is introduced. The basic idea is to replace the original reconstruction only energy, which is optimized to obtain the k affine spaces, by a new energy ...
متن کاملDelaunay Cells for Arrangements of Flats in Hyperbolic Space
For n + 1 disjoint flats of dimension k in H, we produce a Delaunay cell which is a generalization of the Delaunay simplex associated to n + 1 points in H. Combinatorially, these Delaunay cells resemble truncated n-dimensional simplices. For certain classes of arrangements of flats in H, we prove that these Delaunay cells can be glued together to form a Delaunay complex, with the result that al...
متن کاملREAL k-FLATS TANGENT TO QUADRICS IN R
Let dk,n and #k,n denote the dimension and the degree of the Grassmannian Gk,n, respectively. For each 1 ≤ k ≤ n−2 there are 2k,n ·#k,n (a priori complex) k-planes in Pn tangent to dk,n general quadratic hypersurfaces in Pn. We show that this class of enumerative problems is fully real, i.e., for 1 ≤ k ≤ n− 2 there exists a configuration of dk,n real quadrics in (affine) real space Rn so that a...
متن کامل